Combinatorics, Probability and Computing
نویسندگان
چکیده
منابع مشابه
Workshop: Combinatorics, Probability and Computing Table of Contents
One of the exciting phenomena in mathematics in recent years has been the widespread and surprisingly effective use of probabilistic methods in diverse areas. The probabilistic point of view has turned out to be very profitable in Discrete Mathematics, Analysis and Theoretical Computer Science. The meeting was dedicated to recent developments in these areas, focusing on the investigation of ran...
متن کاملCombinatorics of free probability theory
The following manuscript was written for my lectures at the special semester ’Free probability theory and operator spaces’, IHP, Paris, 1999. A complementary series of lectures was given by A. Nica. It is planned to combine both manuscripts into a book A. Nica and R. Speicher: Lectures on the Combinatorics of Free Probability, which will be published by Cambridge University Press
متن کاملNew interactions of Combinatorics and Probability
Algebraic Combinatorics K. Ebrahimi-Fard, ICMAT-CSIC, Madrid, Spain F. Patras, CNRS, Nice, France (3+3 hrs) – The seminal works of G.-C. Rota and his school, have transformed algebraic combinatorics into an important branch of mathematics with connections to a wide variety of subjects, among others, numerical methods for (partial/stochastic) differential equations; control theory; quantum field...
متن کاملNew interactions of Combinatorics and Probability
(3+3 hrs) – The seminal works of G.-C. Rota and his school, have transformed algebraic combinatorics into an important branch of mathematics with connections to a wide variety of subjects, among others, numerical methods for (partial/stochastic) differential equations; control theory; quantum field theory, (free) probability, number theory, discrete geometry, algebraic geometry. In these lectur...
متن کاملThe Subset Partial Order: Computing and Combinatorics
Given a family F of k sets with cardinalities s1, s2, . . . , sk and N = ∑ k i=1 si, we show that the size of the partial order graph induced by the subset relation (called the subset graph) is O( ∑ si≤B 2i + N/ logN · ∑ si>B log (2si/B)), where B = log (N/ log N). This implies a simpler proof to the O(N/ log N) bound concluded in [2]. We also give an algorithm that computes the subset graph fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Oberwolfach Reports
سال: 2006
ISSN: 1660-8933
DOI: 10.4171/owr/2006/48